An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes
نویسندگان
چکیده
Detection of a singleton attractor, which is also called a fixed point, is known to be NP-hard even for AND/OR BNs (i.e., BNs consisting of AND/OR nodes), where the Boolean network (BN) is a mathematical model of genetic networks and singleton attractors correspond to steady states. In our recent paper, we developed an O(1.787) time algorithm for detecting a singleton attractor of a given AND/OR BN where n is the number of nodes. In this paper, we present an O(1.757) time algorithm with which we succeeded in improving the above algorithm.
منابع مشابه
Algorithms for Singleton Attractor Detection in Planar and Nonplanar AND/OR Boolean Networks
Singleton attractor (also called fixed point) detection is known to be NP-hard even for AND/OR BNs (i.e., BNs consisting of AND/OR nodes), where the Boolean network (BN) is a mathematical model of genetic networks and singleton attractors correspond to steady states. In our recent paper, we developed an O(1.787) time algorithm for detecting a singleton attractor of a given AND/OR BN where n is ...
متن کاملA Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth
The Boolean network can be used as a mathematical model for gene regulatory networks. An attractor, which is a state of a Boolean network repeating itself periodically, can represent a stable stage of a gene regulatory network. It is known that the problem of finding an attractor of the shortest period is NP-hard. In this article, we give a fixed-parameter algorithm for detecting a singleton at...
متن کاملDetermining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions
In this article, we study the problem of finding a singleton attractor for several biologically important subclasses of Boolean networks (BNs). The problem of finding a singleton attractor in a BN is known to be NP-hard in general. For BNs consisting of n nested canalyzing functions, we present an O(1.799(n)) time algorithm. The core part of this development is an O(min(2(k/2) · 2(m/2), 2(k)) ·...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008